Efficient continuous top-k geo-image search on road network
نویسندگان
چکیده
منابع مشابه
Efficient Top-k Search Across Heterogeneous XML Data Sources
An important issue arising from XML query relaxation is how to efficiently search the top-k best answers from a large number of XML data sources, while minimizing the searching cost, i.e., finding the k matches with the highest computed scores by only traversing part of the documents. This paper resolves this issue by proposing a bound-threshold based scheduling strategy. It can answer a top-k ...
متن کاملEfficient top-k algorithm for eXtensible Markup Language keyword search
The ability to compute top-k matches to eXtensible Markup Language (XML) queries is gaining importance owing to the increasing of large XML repositories. Current work on top-k match to XML queries mainly focuses on employing XPath, XQuery or NEXI as the query language, whereas little work has concerned on top-k match to XML keyword search. In this study, the authors propose a novel two-layer-ba...
متن کاملEfficient Reverse Top-k Boolean Spatial Keyword Queries on Road Networks
Reverse k nearest neighbor (RkNN) queries have a broad application base such as decision support, profile-based marketing, and resource allocation. Previous work on RkNN search does not take textual information into consideration or limits to the Euclidean space. In the real world, however, most spatial objects are associated with textual information and lie on road networks. In this paper, we ...
متن کاملContinuous Road Network Generalization
This paper presents our research efforts to obtain a sensible vario-scale representation of a road network. A vario-scale representation makes it possible to get maps at an arbitrary map scale, being more flexible with how much detail is shown during the use of geographic data. For this, an offline process creates a suitable vario-scale data structure (called tGAP), that then can be used for ge...
متن کاملEfficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks
A reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k closest points. In recent years, considerable research has been conducted into monitoring reverse k nearest neighbor queries. In this paper, we study the problem of continuous reverse nearest neighbor queries where both the query object q and data objects are moving. Existing state-of-the-art t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Multimedia Tools and Applications
سال: 2018
ISSN: 1380-7501,1573-7721
DOI: 10.1007/s11042-018-6633-x